基于波长调制-直接吸收光谱方法的CO分子1567 nm处谱线参数高精度标定

直接吸收光谱(DAS)可直接测量分子吸收率函数,并通过拟合吸收率函数确定待测气体参数.波长调制-直接吸收光谱(WM-DAS)在DAS基础上,结合了波长调制光谱(WMS)中谐波分析思想,利用傅里叶变换复现吸收率函数,可有效提高吸收率函数的测量精度.本文利用WM-DAS方法结合长光程气体吸收池,在室温低压条件下,对CO分子1567 nm处R5-R11近红外弱吸收谱线吸收率函数进行了精确复现,其拟合残差标准差低至3×10^-5,随后根据测得的吸收率函数对谱线的碰撞展宽、Dicke收敛以及速度依赖的碰撞展宽系数等光谱参数进行了高精度标定,并将其与高灵敏度的连续波腔衰荡光谱(CW-CRDS)测量结果进行了比较,实验结果表明该方法与CW-CRDS测量结果具有高度一致性,更具有系统简单、测量速度快、对环境要求低等优点.     

级联光栅结合Sagnac环的可调谐光纤激光器

提出并验证了一种单-双波长可调谐掺铒光纤激光器。利用级联光纤布拉格光栅(Cascaded Fiber Bragg gratings,Cascaded FBGs)结合Sagnac环结构所产生的复合滤波效应,实现较高精细度滤波,并通过调节环内偏振控制器(Polarization Controller,PC),引入双折射效应,得到波长可调谐的光纤激光器。基于耦合模理论并使用传输矩阵法对该结构的传输特性进行了分析,在此基础上搭建实验系统,验证了理论分析的正确性。实验结果表明:通过调节PC,激光器输出激光的波长范围约为1 555.644～1 556.112 nm,双波长间隔的可调范围约为0.108～0.452 nm,单-双波长的边模抑制比(SMSR)均高于40 dB;在稳定性测试中,输出单-双波长激光的波长最大漂移量小于0.008 nm。该方法具有结构简单、调谐方便、易于实现且精细度较高的优点,可应用于密集波分复用及全光通信系统等领域。     

Wavelength selection framework for classifying food and pharmaceutical samples into multiple classes

Near infrared (NIR) spectroscopy is an efficient, low‐cost analytical technique widely applied to identify the origin of food and pharmaceutical products. NIR spectra‐based classification strategies typically use thousands of equally spaced wavelengths as input information, some of which may not carry relevant information for product classification. When that is the case, the performance of predictive and exploratory multivariate techniques may be undermined by such noisy information. In this paper, we propose an iterative framework for selecting subsets of NIR wavelengths aimed at classifying samples into categories. For that matter, we integrate Principal Components Analysis (PCA) and three classification techniques: k‐Nearest Neighbor (KNN), Probabilistic Neural Network (PNN) and Linear Discriminant Analysis (LDA). PCA is first applied to NIR data, and a wavelength importance index is derived based on the PCA loadings. Samples are then categorized using the wavelength with the highest index and the classification accuracy is calculated; next, the wavelength with the second highest index is inserted into the dataset and a new classification is performed. This forward‐based iterative procedure is carried out until all original wavelengths are inserted into the dataset used for classification. The subset of wavelengths leading to the maximum accuracy is chosen as the recommended subset. Our propositions performed remarkably well when applied to four datasets related to food and pharmaceutical products. Copyright © 2016 John Wiley & Sons, Ltd.     

基于长波长光激发的光敏剂和载体在肿瘤光动力治疗中的应用

光动力疗法是近年来兴起的一种新型的微创性治疗肿瘤的方法,目前已经成功地应用于临床上多种恶性肿瘤治疗中,并取得了良好的效果。然而,由于生物组织对可见光的吸收和散射,使得光线无法穿透组织到达身体内的目标区域,所以该疗法更适用于浅表肿瘤的治疗。长波长光尤其是近红外光具有良好的组织穿透深度,其在治疗组织深处的肿瘤方面具有显著的优势。基于长波长光激发的光敏剂及载体在实体肿瘤的治疗领域已经取得了丰硕的研究成果。本文将从光敏剂的研发、双光子激光的使用、上转换纳米粒子的引入等方面简要概述近十年来用于光动力治疗中的组装体系,以及长波长激发光在光动力治疗方面的发展趋势。     

基于改进免疫遗传算法的近红外光谱变量选择方法

该文在免疫遗传算法（IGA）的基础上,提出一种改进免疫遗传算法（iIGA）用于近红外光谱波长变量的选择。该算法舍去了原算法中固定抗体相似度阈值的思想,取而代之的是抗体相似度阈值自适应,同时引入精英保留策略和贪心算法思想,使得算法朝着正确的方向进行局部性探优。将该算法在玉米的淀粉和蛋白质含量数据集上进行实验测试,建立偏最小二乘（PLS）分析模型,并与IGA、遗传算法（GA）以及全谱方法进行了对比。结果表明,在玉米淀粉含量的预测上,iIGA相较于原IGA算法,预测集均方根误差（RMSEP）从0.312 0降至0.298 0,预测集预测精度提升4.5%;在玉米蛋白质含量的预测上,RMSEP从0.124 4降至0.110 3,预测集预测精度提升11.3%。分别对预测淀粉和蛋白质模型的RMSEP值进行显著性检验,F值分别为165.22和182.05,P值分别为9.5 × 10－23和4.5 × 10－24,P值均小于0.05,因此,iIGA能显著提升模型预测精度。     

High‐temperature superconductivity and long‐range order in strongly correlated electronic systems

A selective review of the question of how repulsive electron correlations might give rise to off‐diagonal long‐range order (ODLRO) in high‐temperature superconductors is presented. The article makes detailed explanations of the relevance to superconductivity of reduced electronic density matrices and how these can be used to understand whether ODLRO might arise from Coulombic repulsions in strongly correlated electronic systems. Time‐reversed electron pairs on alternant Cuprate and the iron‐based pnictide and chalcogenide lattices may have a weak long‐range attractive tail and much stronger short‐range repulsive Coulomb interaction. The long‐range attractive tail may find its origin in one of the many suggested proposals for high‐T_c superconductivity and thus has an uncertain origin. A phenomenological Hamiltonian is invoked whose model parameters are obtained by fitting to experimental data. A detailed summary is given of the arguments that such interacting electrons can cooperate to produce a superconducting state in which time‐reversed pairs of electrons effectively avoid the repulsive hard‐core of the Coulomb interaction but reside on average in the attractive well of the long‐range potential. Thus, the pairing of electrons itself provides an enhanced screening mechanism. The alternant lattice structure is the key to achieving robust high‐temperature superconductivity with dx²‐y² or sign alternating s‐wave or s± condensate symmetries in cuprates and iron‐based compounds. Some attention is also given to the question first raised by Leggett as to where the Coulombic energy is saved in the superconducting transition in cuprates. A mean‐field‐type model in which the condensate density serves as an order parameter is discussed. Many of the observed trends in the thermal properties of cuprate superconductors are reproduced giving strong support for the proposed model for high‐temperature superconductivity in such strongly correlated electronic systems. © 2015 Wiley Periodicals, Inc.     

相关分析与谱分析在表面形貌研究中的应用

本文通过对表面形貌进行相关分析与谱分析,提出了相对波度和有效波度、相对波长和有效波长的概念,并且指出相关分析与谱分析是研究表面形貌润滑效应的有力工具。作者认为,当相对波度为有效波度时,应当同时考虑波长和幅值的摩擦学效应;当相对波度为高频的粗糙度时,只需考虑表面形貌的幅值效应。     

Improvement of resistive switching fluctuations by using one step lift‐off process

Bipolar resistive switching characteristics are investigated in ZrO₂ containing Cu thin layer devices, particularly for the self‐isolated‐structure device fabricated by one step lift‐off process. Compared with the traditional‐structure device, the self‐isolated‐structure device shows more uniform resistive switching characteristics. This is because the isolation of each device cell has negligible influence on each other and thus mitigates possible crosstalk between each cell. These results suggest that the feasibility of good stabilization of the resistive switching parameters can be obtained through one step lift‐off process. (© 2015 WILEY‐VCH Verlag GmbH &Co. KGaA, Weinheim)     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.